Describing query expansion using logic-induced vectors of performance measures

نویسنده

  • M. H. Heine
چکیده

Practical information retrieval is pervaded by Boolean variety as much as it is by term selection. One of the problems of building models that describe IR is therefore that of characterising the effect of Boolean variety on retrieval performance. An approach to this problem is described based on the use of vectors to characterise retrieval performance and focusing on the changes in direction and magnitude of these vectors under the joint influences of term addition (i.e. query expansion) and choice of logic operator. Several novel multivariate constructs are proposed based on this ‘logic/vector’ approach, including: (1) the centroid vector of the vectors defined by ANDing, ORing and AND NOTing a new term to a predecessor search expression, (2) the area defined by the vertices of these three terms, when two or three performance variables are used, and (3) changes to the vector angles induced by these logic operators. The way in which these constructs change during query expansion offers a characterisation of that process and may suggest stopping rules for it. An analysis of MEDLINE data is described which generates several initial hypotheses using these constructs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Query Architecture Expansion in Web Using Fuzzy Multi Domain Ontology

Due to the increasing web, there are many challenges to establish a general framework for data mining and retrieving structured data from the Web. Creating an ontology is a step towards solving this problem. The ontology raises the main entity and the concept of any data in data mining. In this paper, we tried to propose a method for applying the "meaning" of the search system, But the problem ...

متن کامل

Query expansion based on relevance feedback and latent semantic analysis

Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...

متن کامل

QEA: A New Systematic and Comprehensive Classification of Query Expansion Approaches

A major problem in information retrieval is the difficulty to define the information needs of user and on the other hand, when user offers your query there is a vast amount of information to retrieval. Different methods , therefore, have been suggested for query expansion which concerned with reconfiguring of query by increasing efficiency and improving the criterion accuracy in the information...

متن کامل

On Expanding Query Vectors with Lexically Related Words

Experiments performed on small collections suggest that expanding query vectors with words that are lexically related to the original query words can improve retrieval eeectiveness. Prior experiments using WordNet to automatically expand vectors in the large TREC-1 collection were inconclusive regarding eeec-tiveness gains from lexically related words since any such eeects were dominated by the...

متن کامل

Improving Robustness Using Query Expansion

This paper describes our work at CLEF 2007 Robust Task. We have applied local query expansion using windows of terms, but considering different measures of robustness during the training phase in order to optimize the performance: MAP, GMAP, MMR, GS@10, P@10, number of failed topics, number of topics below 0.1 MAP, and number of topics with P@10=0. The results were not disappointing, but no set...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000